Skew cyclic codes over $\mathbb{F}_{p}+u\mathbb{F}_{p}$
نویسندگان
چکیده
In this paper, we study skew cyclic codes with arbitrary length over the ring $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$ where $p$ is an odd prime and $% u^{2}=0$. We characterize all skew cyclic codes of length $n$ as left $% R[x;\theta ]$-submodules of $R_{n}=R[x;\theta ]/\langle x^{n}-1\rangle $. We find all generator polynomials for these codes and describe their minimal spanning sets. Moreover, an encoding and decoding algorithm is presented for skew cyclic codes over the ring $R$. Finally, based on the theory we developed in this paper, we provide examples of codes with good parameters over $F_{p}$ with different odd prime $p.$ In fact, example 25 in our paper is a new ternary code in the class of quasi-twisted codes. The other examples we provided are examples of optimal codes.
منابع مشابه
Skew cyclic codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$
In this article, we study skew cyclic codes over ring R = Fq + vFq + v 2 Fq, where q = p, p is an odd prime and v3 = v. We describe generator polynomials of skew cyclic codes over this ring and investigate the structural properties of skew cyclic codes over R by a decomposition theorem. We also describe the generator polynomials of the duals of skew cyclic codes. Moreover, the idempotent genera...
متن کامل2-D skew constacyclic codes over R[x, y; ρ, θ]
For a finite field $mathbb{F}_q$, the bivariate skew polynomial ring $mathbb{F}_q[x,y;rho,theta]$ has been used to study codes cite{XH}. In this paper, we give some characterizations of the ring $R[x,y;rho,theta]$, where $R$ is a commutative ring. We investigate 2-D skew $(lambda_1,lambda_2)$-constacyclic codes in the ring $R[x,y;rho,theta]/langle x^l-lambda_1,y^s-lambda_2rangle_{mathit{l}}.$ A...
متن کاملOne Cyclic Codes over $\mathbb{F}_{p^k} + v\mathbb{F}_{p^k} + v^2\mathbb{F}_{p^k} + ... + v^r\mathbb{F}_{p^k}$
In this paper, we investigate cyclic code over the ring Fpk + vFpk + v 2 Fpk + ...+ v r Fpk , where v = v, p a prime number, r > 1 and gcd(r, p) = 1, we prove as generalisation of [9] that these codes are principally generated, give generator polynomial and idempotent depending on idempotents over this ring as response to an open problem related in [11]. we also give a gray map and proprieties ...
متن کاملGeneralized Quasi-Cyclic Codes Over $\mathbb{F}_q+u\mathbb{F}_q$
Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring Fq + uFq, where u 2 = 0, q = p, n a positive integer and p a prime number, are investigated. By the Chinese Remainder Theorem, structural properties and the decomposition of GQC codes are given. For 1-generator GQC codes, minimal generating sets and lower bounds on the minimum distance are given. As a special class of GQC...
متن کامل$\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})$-Linear Skew Constacyclic Codes
In this paper, we study skew constacyclic codes over the ring ZqR where R = Zq + uZq, q = p s for a prime p and u2 = 0. We give the definition of these codes as subsets of the ring ZqR . Some structural properties of the skew polynomial ring R[x, θ] are discussed, where θ is an automorphism of R. We describe the generator polynomials of skew constacyclic codes over R and ZqR. Using Gray images ...
متن کامل